Mobile Service Robot Path Planning using Deep Reinforcement Learning

نویسندگان

چکیده

A mobile service robot operates in a constantly changing environment with other robots and humans. The is usually vast unknown, the expected to operate continuously for long period. can be dynamic, leading generation of new routes or permanent blocking old routes. traditional path planner that relies on static maps will not suffice dynamic environment. This work focused developing reinforcement learning-based proposed system uses deep Q-Learning algorithm learn initial paths using topological map In an environmental change, β-decay transfer learning trains agent experience vs. exploration exploitation-based training depending similarity environments. implemented Robotic Operating System framework tested Turtlebot3 Gazebo simulator. experimental results show learns all based different environments accuracy over 98%. comparative analysis non-transfer agents performed various evaluation metrics. converges twice faster than agent.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile Robot Path Planning Using Genetic Algorithms

Genetic Algorithms (GAs) have demonstrated to be effective procedures for solving multicriterion optimization problems. These algorithms mimic models of natural evolution and have the ability to adaptively search large spaces in near-optimal ways. One direct application of this intelligent technique is in the area of evolutionary robotics, where GAs are typically used for designing behavioral c...

متن کامل

Mobile Robot Path Planning Based on Improved Q Learning Algorithm

For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Path Planning for a Statically Stable Biped Robot Using PRM and Reinforcement Learning

In this paper path planning and obstacle avoidance for a statically stable biped robot using PRM and reinforcement learning is discussed. The main objective of the paper is to compare these two methods of path planning for applications involving a biped robot. The statically stable biped robot under consideration is a 4-degree of freedom walking robot that can follow any given trajectory on fla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3311519